The binary knapsack problem with qualitative levels

A variant of the classical knapsack problem is considered in which each item associated with an integer weight and a qualitative level. We define dominance relation over feasible subsets given set show that this defines preorder. propose dynamic programming algorithm to compute entire non-dominated rank cardinality vectors we state two greedy algorithms, efficiently single efficient solution.